Mirror Compensator for Testing Convex Secondary
نویسندگان
چکیده
منابع مشابه
Sensitivity Analysis for Mirror-Stratifiable Convex Functions
This paper provides a set of sensitivity analysis and activity identification results for a class of convex functions with a strong geometric structure, that we coined “mirror-stratifiable”. These functions are such that there is a bijection between a primal and a dual stratification of the space into partitioning sets, called strata. This pairing is crucial to track the strata that are identif...
متن کاملThermal noise of a plano-convex mirror
We study theoretically the internal thermal noise of a mirror coated on a plano-convex substrate. The effect on a light beam strongly depends on the spatial matching between the light and the acoustic modes of the mirror. The comparison with a cylindrical mirror of the same mass shows that the effect of thermal noise can be reduced by a factor 10 with a plano-convex geometry, improving the sens...
متن کاملMirror descent in non-convex stochastic programming
In this paper, we examine a class of nonconvex stochastic optimization problems which we call variationally coherent, and which properly includes all quasi-convex programs. In view of solving such problems, we focus on the widely used stochastic mirror descent (SMD) family of algorithms, and we establish that the method’s last iterate converges with probability 1. We further introduce a localiz...
متن کاملA Weighted Mirror Descent Algorithm for Nonsmooth Convex Optimization Problem
Large scale nonsmooth convex optimization is a common problem for a range of computational areas including machine learning and computer vision. Problems in these areas contain special domain structures and characteristics. Special treatment of such problem domains, exploiting their structures, can significantly improve the computational burden. We present a weighted Mirror Descent method to so...
متن کاملMirror descent and nonlinear projected subgradient methods for convex optimization
The mirror descent algorithm (MDA) was introduced by Nemirovsky and Yudin for solving convex optimization problems. This method exhibits an e3ciency estimate that is mildly dependent in the decision variables dimension, and thus suitable for solving very large scale optimization problems. We present a new derivation and analysis of this algorithm. We show that the MDA can be viewed as a nonline...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Astronomical Union Colloquium
سال: 1984
ISSN: 0252-9211
DOI: 10.1017/s0252921100108322